Bayesianism, frequentism, and the planted clique, or do algorithms believe in unicorns?
نویسنده
چکیده
Both sides agree that it is correct, but they disagree on what the symbols mean. For frequentists, probabilities refer to the fraction that an event happens over repeated samples. They think of probability as counting, or an extension of combinatorics. For Bayesians, probabilities refer to degrees of belief, or, if you want, the odds that you would place on a bet. They see probability as an extension of logic.1
منابع مشابه
Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)
In this high level and accessible talk I will describe a recent line of works aimed at trying to understand the intrinsic complexity of computational problems by finding optimal algorithms for large classes of such problems. In particular, I will talk about efforts centered on convex programming as a source for such candidate algorithms. As we will see, a byproduct of this effort is a computati...
متن کاملBayes and health care research.
Bayes' rule shows how one might rationally change one's beliefs in the light of evidence. It is the foundation of a statistical method called Bayesianism. In health care research, Bayesianism has its advocates but the dominant statistical method is frequentism. There are at least two important philosophical differences between these methods. First, Bayesianism takes a subjectivist view of proba...
متن کاملCS 264 : Beyond Worst - Case Analysis Lectures # 11 and 12 : SDP Algorithms for Semi - Random Bisection and Clique ∗
Lectures #9 and #10 studied the planted bisection (a.k.a. community detection) and planted clique models, where we posited specific parameterized input distributions (parameterized by edge densities p and q within and between clusters, or by planted the clique size k), in which a “clearly optimal” solution is planted in an otherwise random graph. The goal was to identify necessary and sufficien...
متن کاملWhy Frequentists and Bayesians Need Each Other
The orthodox view in statistics has it that frequentism and Bayesianism are diametrically opposed—two totally incompatible takes on the problem of statistical inference. This paper argues to the contrary that the two approaches are complementary and need to mesh if probabilistic reasoning is to be carried out correctly.
متن کاملStatistical Algorithms and a Lower Bound for Detecting Planted Clique
We introduce a framework for proving lower bounds on computational problems over distributions, for a class of algorithms called statistical algorithms. For such algorithms, access to the input distribution is limited to obtaining an estimate of the expectation of any given function on a sample drawn randomly from the input distribution, rather than directly accessing samples. Most natural algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016